Multiple Testing in Genomic Sequences Using Hamming Distance
نویسندگان
چکیده
منابع مشابه
Distance protection closed-loop testing using RTDS
This paper presents a distance protection test procedure by applying the Real-Time Digital Simulator (RTDS) of a power system. RTDS is a tool to design, develop, and test power-system protection. The RTDS enables real-time computation of electromagnetic phenomena with a calculation time step of even 50μs. The hardware allows the import and export of many signals from the simulator to an ext...
متن کاملA Block-Sensitivity Lower Bound for Quantum Testing Hamming Distance
The Gap-Hamming distance problem is the promise problem of deciding if the Hamming distance h between two strings of length n is greater than a or less than b, where the gap g = |a − b| ≥ 1 and a and b could depend on n. In this short note, we give a lower bound of Ω( √ n/g) on the quantum query complexity of computing the GapHamming distance between two given strings of lenght n. The proof is ...
متن کاملUsing Hamming Distance as Information for SNP-Sets Clustering and Testing in Disease Association Studies
The availability of high-throughput genomic data has led to several challenges in recent genetic association studies, including the large number of genetic variants that must be considered and the computational complexity in statistical analyses. Tackling these problems with a marker-set study such as SNP-set analysis can be an efficient solution. To construct SNP-sets, we first propose a clust...
متن کاملMultiple Alignment of Genomic Sequences
Genomic sequence is currently available from ENTREZ for more than 40 eukaryotic and 157 prokaryotic organisms. As part of the ongoing NIH Intramural Sequencing Center’s, Comparative Vertebrate Sequencing project, genomic sequences will soon be available from 50 vertebrates for regions orthologous to defined regions of the human genome. Managing and interpreting these sequence data requires new ...
متن کاملHamming distance for conjugates
Let x, y be strings of equal length. The Hamming distance h(x, y) between x and y is the number of positions in which x and y differ. If x is a cyclic shift of y, we say x and y are conjugates. We consider f(x, y), the Hamming distance between the conjugates xy and yx. Over a binary alphabet f(x, y) is always even, and must satisfy a further technical condition. By contrast, over an alphabet of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications for Statistical Applications and Methods
سال: 2012
ISSN: 2287-7843
DOI: 10.5351/ckss.2012.19.6.899